Combined Heat and Power Economic Dispatch using Improved Shuffled Frog Leaping Algorithm

نویسندگان

  • Javad Nikoukar Department of Technical Engineering, Saveh Branch, Islamic Azad University, Saveh, Iran
  • Majid Khalili Department of Technical Engineering, Saveh Branch, Islamic Azad University, Saveh, Iran
چکیده مقاله:

Recently, Combined Heat and Power (CHP) systems have been utilized increasingly in power systems. With the addition penetration of CHP-based co-generation of electricity and heat, the determination of economic dispatch of power and heat becomes a more complex and challenging issue. The optimal operation of CHP-based systems is inherently a nonlinear and non-convex optimization problem with a lot of local optimal solutions. In this paper, the Improved Shuffled Frog Leaping Algorithm (ISFLA) is used for solution of the problem. ISFLA is an improved version of shuffled frog leaping algorithm in which new solutions are produced in respect to global best solution. The ISFLA is well able to attain the optimal solutions even in the case of non-convex optimization problems. To evaluate the efficiency of the proposed method, it has been implemented on the standard test system. The obtained results have been compared with other heuristic methods. The numerical results show that the ISFLA is faster and more precise than other methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Economic Emission Load Dispatch by Modified Shuffled Frog Leaping Algorithm

This paper presents a newly developed optimization approach involving a modified shuffled frog leaping algorithm (MSFLA) applied for the solution of the economic emission load dispatch (EELD) problem. The approach utilizes the local search strategies for searching global solution. MSFLA is developed on the same frame work of shuffled frog leaping algorithm (SFLA). In this proposed algorithm, a ...

متن کامل

An Improved Shuffled Frog Leaping Algorithm ⋆

In order to overcome the defects of Shuffled Frog Leaping Algorithm (SFLA) such as nonuniform initial population, slow searching speed in the late evolution and easily trapping into local extremum, a new Shuffled Frog Leaping Algorithm based on mutation operator and population diversity is proposed in this paper. The algorithm has overcome the disadvantage mentioned above. The algorithm efficie...

متن کامل

Multiobjective Optimal Reactive Power Dispatch Considering Voltage Stability Using Shuffled Frog Leaping Algorithm

This study addresses a shuffled frog leaping algorithm for solving the multi-objective reactive power dispatch problem in a power system. Optimal Reactive Power Dispatch (ORPD) is formulated as a nonlinear, multimodal and mixed-variable problem. The intended technique is based on the minimization of the real power loss, minimization of voltage deviation and maximization of the voltage stability...

متن کامل

Modified Shuffled Frog Leaping Algorithm for Solving Economic Load Dispatch Problem

In the recent restructured power system scenario and complex market strategy, operation at absolute minimum cost is no longer the only criterion for dispatching electric power. The economic load dispatch (ELD) problem which accounts for minimization of both generations cost and power loss is itself a multiple conflicting objective function problem. In this paper, a modified shuffled frog-leapin...

متن کامل

A Modified Shuffled Frog-Leaping Optimization Algorithm for Solving Optimal Reactive Power Dispatch Problem

: This paper presents an algorithm for solving the multi-objective reactive power dispatch problem in a power system. Modal analysis of the system is used for static voltage stability assessment. Loss minimization and maximization of voltage stability margin are taken as the objectives. Generator terminal voltages, reactive power generation of the capacitor banks and tap changing transformer se...

متن کامل

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

Shuffled frog-leaping algorithm (SFLA) has long been considered as new evolutionary algorithm of group evolution, and has a high computing performance and excellent ability for global search. Knapsack problem is a typical NP-complete problem. For the discrete search space, this paper presents the improved SFLA (ISFLA), and solves the knapsack problem by using the algorithm. Experimental results...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 12  شماره 1

صفحات  1- 11

تاریخ انتشار 2021-02-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023